s = input()
n = len(s)
st = ""
l = 0
r = n - 1
if(n % 2 == 0):
while(l <= r):
st = s[r] + st
r -= 1
if(l <= r):
st = s[l] + st
l += 1
else:
while(l <= r):
st = s[l] + st
l += 1
if(l <= r):
st = s[r]+ st
r -= 1
print(st)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
//int n;cin>>n;
string s;cin>>s;
int start=0;int end=s.length()-1;
string p="";
int l=s.length();
while(start<=end){
if(start==end){
p=s[end]+p;break;
}
if(start!=end&&!(l&1)){
p=s[end]+p;
p=s[start]+p;}
else{
p=s[start]+p;
p=s[end]+p;
}
end--;start++;
}
cout<<p<<endl;
return 0;}mr ilvr eihthetddeeWhr i h ichkrtae nfo?
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |